Bilabelled increasing trees and hook-length formulae

نویسندگان

  • Markus Kuba
  • Alois Panholzer
چکیده

We introduce two different kind of increasing bilabellings of trees, for which we provide enumeration formulæ. One of the bilabelled tree families considered is enumerated by the reduced tangent numbers and is in bijection with a tree family introduced by Poupard [11]. Both increasing bilabellings naturally lead to hook-length formulas for trees and forests; in particular, one construction gives a combinatorial interpretation of a formula for labelled unordered forests obtained recently by Chen et al. [1].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A multivariate hook formula for labelled trees

Several hook summation formulae for binary trees have appeared recently in the literature. In this paper we present an analogous formula for unordered increasing trees of size r, which involves r parameters. The righthand side can be written nicely as a product of linear factors. We study two specializations of this new formula, including Cayley’s enumeration of trees with respect to vertex deg...

متن کامل

Probabilistic proofs of hook length formulas involving trees

Let T be a rooted tree with n distinguishable vertices. We use T to stand for the vertex set of T . An increasing labeling of T is a bijection ` : T → {1, 2, . . . , n} such that `(v) ≤ `(w) for all descendents w of v. Let f be the number of increasing labelings. The hooklength, hv, of a vertex v is the number of descendents of v (including v itself). The hook length formula for trees states th...

متن کامل

Combinatorial families of multilabelled increasing trees and hook-length formulas

In this work we introduce and study various generalizations of the notion of increasingly labelled trees, where the label of a child node is always larger than the label of its parent node, to multilabelled tree families, where the nodes in the tree can get multiple labels. For all tree classes we show characterizations of suitable generating functions for the tree enumeration sequence via diff...

متن کامل

Discovering Hook Length Formulas by an Expansion Technique

— We introduce a hook length expansion technique and explain how to discover old and new hook length formulas for partitions and plane trees. The new hook length formulas for trees obtained by our method can be proved rather easily, whereas those for partitions are much more difficult and some of them still remain open conjectures. We also develop a Maple package HookExp for computing the hook ...

متن کامل

Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees

— We discover another one-parameter generalization of Postnikov's hook length formula for binary trees. The particularity of our formula is that the hook length h v appears as an exponent. As an application, we derive another simple hook length formula for binary trees when the underlying parameter takes the value 1/2.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2012